On some balanced, totally balanced and submodular delivery games
نویسندگان
چکیده
منابع مشابه
Agent Failures in Totally Balanced Games and Convex Games
We examine the impact of independent agents failures on the solutions of cooperative games, focusing on totally balanced games and the more speci c subclass of convex games. We follow the reliability extension model, recently proposed in [1] and show that a (approximately) totally balanced (or convex) game remains (approximately) totally balanced (or convex) when independent agent failures are ...
متن کاملOn some approximately balanced combinatorial cooperative games
A model of taxation for cooperative n-person games is introduced where proper coalitions are taxed proportionally to their value. Games with non-empty core under taxation at rate e are a-balanced. Sharp bounds on e in matching games on (not necessarily bipartite) graphs are established. Upper and lower bounds on the smallest e in bin packing games are derived and euclidean random TSP games are ...
متن کاملSubadditive and Homogeneous of Degree One Games Are Totally Balanced
A cooperative game with transferable utility is said to be homogeneous of degree one if for any integer m, the value of cloning m times all players at any given coalition, leads to m times the value of the original coalition. We show that this property coupled with sub-additivity, guarantee the non-emptyness of the core of the game and of all its subgames, namely the game is totally balanced. E...
متن کاملSome Remarks on Sign-Balanced and Maj-Balanced Posets
Let P be an n-element poset (partially ordered set), and let ω : P → [n] = {1, 2, . . . , n} be a bijection, called a labeling of P . We call the pair (P, ω) a labelled poset. A linear extension of P is an order-preserving bijection f : P → [n]. We can regard f as defining a permutation π = π(f) of the set [n] given by π(i) = j if f(ω(j)) = i. We write π in the customary way as a word a1a2 · · ...
متن کاملLocal Search for Balanced Submodular Clusterings
In this paper, we consider the problem of producing balanced clusterings with respect to a submodular objective function. Submodular objective functions occur frequently in many applications, and hence this problem is broadly applicable. We show that the results of Patkar and Narayanan [8] can be applied to cases when the submodular function is derived from a bipartite object-feature graph, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1999
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s101070050093